Abstract Initiality
نویسندگان
چکیده
initiality Lutz Schröder, Horst Herrlich Abstract. We study morphisms that are initial w.r.t. all functors in a given conglomerate. Several results and counterexamples are obtained concerning the relation of such properties to different notions of subobject. E.g., strong monomorphisms are initial w.r.t. all faithful adjoint functors, but not necessarily w.r.t. all faithful monomorphism-preserving functors; morphisms that are initial w.r.t. all faithful monomorphism-preserving functors are monomorphisms, but need not be extremal; and (under weak additional conditions) a morphism is initial w.r.t. all faithful functors that map extremal monomorphisms to monomorphisms iff it is an extremal monomorphism. We study morphisms that are initial w.r.t. all functors in a given conglomerate. Several results and counterexamples are obtained concerning the relation of such properties to different notions of subobject. E.g., strong monomorphisms are initial w.r.t. all faithful adjoint functors, but not necessarily w.r.t. all faithful monomorphism-preserving functors; morphisms that are initial w.r.t. all faithful monomorphism-preserving functors are monomorphisms, but need not be extremal; and (under weak additional conditions) a morphism is initial w.r.t. all faithful functors that map extremal monomorphisms to monomorphisms iff it is an extremal monomorphism.
منابع مشابه
Extended Initiality for Typed Abstract Syntax
Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of “models”, yielding induction and recursion principles for abstract syntax. Zsidó [Zsi10, Chap. 6] proves an initiality result for simply–typed syntax: given a signature S, the abstract syntax associated to S constitutes the initial object in a category of models of S in monads. ...
متن کاملTowards a Theory of Abstract Data Types: A Discussion on Problems and Tools
This paper aims to show that, in order to capture a quite relevant feature such as the recursiveness of abstract data types, Model Theory works better than Category Theory. First, various eategorial notions such as "initiality", "finality", "monoinitiality", "epifinality", "weak monoinitiality" and "weak epifinality' are analyzed, from a model theoretic point of view, as regards the "abstractne...
متن کاملModules over relative monads for syntax and semantics
The goal of this article is to give an algebraic characterisation of the abstract syntax of functional programming languages, equipped with reduction rules. We introduce a notion of 2–signature: such a signature specifies not only the terms of a language, but also reduction rules on those terms. To any 2–signature S we associate a category of “models” of S, and we prove that this category has a...
متن کاملOrder-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations
This paper generalizes many-sorted algebra (hereafter, MSA) to order-sorted algebra (hereafter, OSA) by allowing a partial ordering relation on the set of sorts. This supports abstract data types with multiple inheritance (in roughly the sense of object-oriented programming), several forms of polymorphism and overloading, partial operations (as total on equationally deened subsorts), exception ...
متن کاملProviding Libraries of Algebraically Specified Datatypes in Z
This work was produced under the auspices of the SERC funded project GR/G49531. Z, Z Method, OBJ, Abstract Datatypes, Safety Critical Systems, Initiality Z is a rich and expressive speci cation language. It is possible to use Z to produce clear, abstract and elegant speci cations; it is also possible to use Z to produce meaningless speci cations. One of the overall aims of the research work in ...
متن کامل